Optimal Boundary Triangulations of an Interpolating Ruled Surface
نویسندگان
چکیده
We investigate how to define a triangulated ruled surface interpolating two polygonal directrices that will meet a variety of optimization objectives which originate from many CAD/CAM and geometric modeling applications. This optimal triangulation problem is formulated as a combinatorial search problem whose search space however has the size tightly factorial to the numbers of points on the two directrices. To tackle this bound, we introduce a novel computational tool called multilayer directed graph and establish an equivalence between the optimal triangulation and the single-source shortest path problem on the graph. Well known graph search algorithms such as the Dijkstra’s are then employed to solve the single-source shortest path problem, which effectively solves the optimal triangulation problem in O mn time, where n and m are the numbers of vertices on the two directrices respectively. Numerous experimental examples are provided to demonstrate the usefulness of the proposed optimal triangulation problem in a variety of engineering applications. DOI: 10.1115/1.2052850
منابع مشابه
Polynomial Surfaces Interpolating Arbitrary Triangulations
Triangular Bézier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bézier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we int...
متن کاملLayered - Triangulations of 3 – Manifolds
A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...
متن کاملA Fast Algorithm for Computing Irreducible Triangulations of Closed Surfaces in E and Its Application to the TriQuad Problem
Let S be a compact surface with empty boundary. A classical result from the 1920s by Tibor Radó asserts that every compact surface with empty boundary (usually called a closed surface) admits a triangulation [1]. Let e be any edge of a triangulation T of S . The contraction of e in T consists of contracting e to a single vertex and collapsing each of the two triangles meeting e into a single ed...
متن کاملRational Ruled surfaces construction by interpolating dual unit vectors representing lines
In this paper, a new representational model is introduced for the rational family of ruled surfaces in Computer Graphics. The surface parameterization is constructed using the NURBS basis functions and line geometry. The ruled surface is defined by interpolating directly dual unit vectors representing lines, which is a single parametric surface and its shape depends on the control lines. All th...
متن کاملOptimal encoding of triangular and quadrangular meshes with fixed topology
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulations and bipartite quadrangulations on an orientable surface of fixed topology τ (given by the genus g and number of boundaries b). To our knowledge, our encoding procedure is the first to be asymptotically optimal (in t...
متن کامل